Designing Eecient Master-slave Parallel Genetic Algorithms Designing Eecient Master-slave Parallel Genetic Algorithms
نویسنده
چکیده
A simple technique to reduce the execution time of genetic algorithms (GAs) is to divide the task of evaluating the population among several processors. This class of algorithms is called \global" parallel GAs because selection and mating consider the entire population. Global parallel GAs are usually implemented as master-slave programs and require constant interprocessor communication. This will aaect their performance, but most investigations of these algorithms ignore the penalty caused by communications. This paper presents an analysis of the execution time of global parallel GAs that includes a simple model of the time used in communications and shows that there is an optimal number of processors that minimizes the execution time. To further reduce the execution time we recommend the use of hybrids that combine global and coarse-grained parallel GAs.
منابع مشابه
Implementing Fast and Flexible Parallel Genetic Algorithms
As genetic algorithms (GAs) are used to solve harder problems, it is becoming necessary to use better algorithms and more eecient implementations to reach good solutions fast. This chapter describes the implementation of master-slave and multiple-population parallel GAs. The goal of the chapter is to help others to implement their own parallel codes. To this eeect, the text discusses some of th...
متن کاملThe Design and Implementation of MPI Master-Slave Parallel Genetic Algorithm
In this paper, the MPI master-slave parallel genetic algorithm is implemented by analyzing the basic genetic algorithm and parallel MPI program, and building a Linux cluster. This algorithm is used for the test of maximum value problems (Rosen brocks function) .And we acquire the factors influencing the master-slave parallel genetic algorithm by deriving from the analysis of test data. The expe...
متن کاملSolving Signal Coordination Problems Using Master- Slave Genetic Algorithms
This paper presents the design of master-slave genetic algorithms (GA) in solving signal coordination problems. When a serial GA is applied, its performance in terms of computation time diminishes as more accurate results (smaller time slices to evaluate flows and queues) of network performances are needed, or the size of signal networks increases. Because GA works with a population of independ...
متن کاملSingle-walk Parallelization of the Genetic Algorithm
Abstract: This paper aims at presenting theoretical properties which can be used to approximate the theoretical speedup of parallel genetic algorithms. The most frequently parallelization method employed to genetic algorithm implements a master-slave model by distributing the most computationally exhausting elements of the algorithm (usually evaluation of the fitness function, i.e. cost functio...
متن کاملAn effective parallel approach for genetic-fuzzy data mining
Data mining is most commonly used in attempts to induce association rules from transaction data. In the past, we used the fuzzy and GA concepts to discover both useful fuzzy association rules and suitable membership functions from quantitative values. The evaluation for fitness values was, however, quite time-consuming. Due to dramatic increases in available computing power and concomitant decr...
متن کامل